Logical limits of abstract argumentation frameworks

نویسندگان

  • Leila Amgoud
  • Philippe Besnard
چکیده

Dung’s argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, wrt a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions about the compatibility of the setting with a logical formalism (i.e., whether it is possible to instantiate it properly from a logical knowledge base), and about the significance of the various semantics in the application context.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract Argumentation Scheme Frameworks

Argumentation Scheme Frameworks Katie Atkinson and Trevor Bench-Capon Department of Computer Science University of Liverpool Liverpool L69 3BX UK {K.M.Atkinson,tbc}@liverpool.ac.uk Abstract. This paper presents an approach to modelling and reasoning about arguments that exploits and combines two of the most popular mechanisms used within computational modelling of argumentation: argumentation s...

متن کامل

Closure and Consistency In Logic-Associated Argumentation

Properties like logical closure and consistency are important properties in any logical reasoning system. Caminada and Amgoud showed that not every logic-based argument system satisfies these relevant properties. But under conditions like closure under contraposition or transposition of the monotonic part of the underlying logic, ASPIC-like systems satisfy these properties. In contrast, the log...

متن کامل

A Structural Benchmark for Logical Argumentation Frameworks

This paper proposes a practically-oriented benchmark suite for computational argumentation. We instantiate abstract argumentation frameworks with existential rules, a language widely used in Semantic Web applications and provide a generator of such instantiated graphs. We analyse performance of argumentation solvers on these benchmarks.

متن کامل

Using Enthymemes to Fill the Gap between Logical Argumentation and Revision of Abstract Argumentation Frameworks

In this paper, we present a preliminary work on an approach to fill the gap between logic-based argumentation and the numerous approaches to tackle the dynamics of abstract argumentation frameworks. Our idea is that, even when arguments and attacks are defined by means of a logical belief base, there may be some uncertainty about how accurate is the content of an argument, and so the presence (...

متن کامل

Doing Argumentation using Theories in Graph Normal Form

We explore some links between abstract argumentation, logic and kernels in digraphs. Viewing argumentation frameworks as propositional theories in graph normal form, we observe that the stable semantics for argumentation can be given equivalently in terms of satisfaction and logical consequence in classical logic. We go on to show that the complete semantics can be formulated using Lukasiewicz ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Applied Non-Classical Logics

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2013